Bayesian Model Selection for Exponential Random Graph Models via Adjusted Pseudolikelihoods
نویسندگان
چکیده
منابع مشابه
Exponential random graph models
Synonyms p* models, p-star models, p1 models, exponential family of random graphs, maximum entropy random networks, logit models, Markov graphs Glossary • Graph and network: the terms are used interchangeably in this essay. • Real-world network: (real network, observed network) means network data the researcher has collected and is interested in modelling. • Ensemble of graphs: means the set of...
متن کاملBayesian inference of exponential random graph models under measurement errors
While the impact of measurement errors inherent in network data has been widely recognized, relatively little work has been done to solve the problem mainly due to the complex dependence nature of network data. In this paper, we propose a Bayesian inference framework for summary statistics of the true underlying network, based on the network observed with measurement errors. To the best of our ...
متن کاملLearning Exponential Random Graph Models
Exponential Random Graphs are common, simple statistical models for social network and other structures. Unfortunately, inference and learning with them is hard for networks larger than 20 nodes because their partition functions are intractable to compute precisely. In this paper, we introduce a novel linear-time deterministic approximation to these partition functions. Our main insight enablin...
متن کاملGraph Model Selection via Random Walks
In this paper, we present a novel approach based on the random walk process for finding meaningful representations of a graph model. Our approach leverages the transient behavior of many short random walks with novel initialization mechanisms to generate model discriminative features. These features are able to capture a more comprehensive structural signature of the underlying graph model. The...
متن کاملNew Specifications for Exponential Random Graph Models
The most promising class of statistical models for expressing structural properties of social networks observed at one moment in time is the class of exponential random graph models (ERGMs), also known as p ∗ models. The strong point of these models is that they can represent a variety of structural tendencies, such as transitivity, that define complicated dependence patterns not easily modeled...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Graphical Statistics
سال: 2018
ISSN: 1061-8600,1537-2715
DOI: 10.1080/10618600.2018.1448832